Sum-based weighted belief base merging: From commensurable to incommensurable framework

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analysis of Sum-Based Incommensurable Belief Base Merging

Different methods have been proposed for merging multiple and potentially conflicting informations. Sum-based operators offer a natural method for merging commensurable prioritized belief bases. Their popularity is due to the fact that they satisfy the majority property and they adopt a non cautious attitude in deriving plausible conclusions. This paper analyses the sum-based merging operator w...

متن کامل

Belief Base Merging as a Game

We propose in this paper a new family of belief merging operators, that is based on a game between sources : until a coherent set of sources is reached, at each round a contest is organized to find out the weakest sources, then those sources has to concede (weaken their point of view). This idea leads to numerous new interesting operators (depending of the exact meaning of “weakest” and “conced...

متن کامل

Belief Base Rationalization for Propositional Merging

Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are ”rationalized” with respect to the integrity constraints during the merging process. We define in formal terms several independence conditions for...

متن کامل

Quantum-Based Belief Merging

Belief merging aims at building a common belief set issued from multiple belief sets. The quality of the resulting set is usually considered in terms of a closeness criterion between the initial belief sets and an integrity constraint with respect to the aim of the merging procedure. The notion of distance between belief sets is thus a crucial issue when we face the merging problem. The aim of ...

متن کامل

Merging Incommensurable Possibilistic DL-Lite Assertional Bases

This short paper studies the problem of merging of different independent data sources linked to a lightweight ontology under the incommensurability assumption. In general, data are often provided by several and potentially conflicting sources of information having different levels of priority. To encode prioritized assertional bases, we use possibilistic DLLite logic. We investigate an egalitar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2014

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2014.04.006